Because the garbage collection algorithm is nondeterministic , the 由于垃圾回收算法是非確定性的,因此可能會立即調(diào)用
When evaluating a garbage collection algorithm , we might consider any or all of the following criteria 在對垃圾收集算法進(jìn)行評價時,我們可能要考慮以下所有標(biāo)準(zhǔn):
John wiley sons , 1997 is a comprehensive survey of garbage collection algorithms , with an extensive bibliography John wiley sons , 1997年是對垃圾收集算法的全面評述,包括大量參考書目。
The garbage collection algorithm is nondeterministic , so you cannot determine when the clr will release an object s resources 垃圾回收算法是非確定性的,因此無法確定clr釋放對象資源的時間。
Because garbage collection algorithms vary , some algorithms analyze older , longer - lived objects less frequently than short - lived objects 由于各種垃圾收集算法有所不同,某些算法會更頻繁地分析生存期較短的對象,而不是較老、生存期較長的對象。
Many garbage collection algorithms require dividing the heap into separate memory spaces , some of which may be inaccessible to the user program at certain times 許多垃圾收集算法需要將堆分割成獨(dú)立的內(nèi)存空間,其中一些空間在某些時刻對用戶程序是不可訪問的。
The problem faced by all garbage collection algorithms is the same - identify blocks of memory that have been dispensed by the allocator , but are unreachable by the user program 所有垃圾收集算法所面臨的問題是相同的找出由分配器分配的,但是用戶程序不可到達(dá)的內(nèi)存塊。
Some garbage collection algorithms require significant cooperation from the compiler or runtime environment , such as updating reference counts whenever a pointer assignment is performed 一些垃圾收集算法要求編譯器或者運(yùn)行時環(huán)境的重要配合,如當(dāng)進(jìn)行指針分配時更新引用計數(shù)。
The runtime s garbage collection algorithm is based on several generalizations that the computer software industry has discovered to be true by experimenting with garbage collection schemes 運(yùn)行時的垃圾回收算法基于以下幾個普遍原理,這些垃圾回收方案的原理已在計算機(jī)軟件業(yè)通過實(shí)驗(yàn)得到了證實(shí)。